Regular Programming over Data Streams
نویسندگان
چکیده
REGULAR PROGRAMMING OVER DATA STREAMS
منابع مشابه
Top-k Pattern Matching Using an Information-Theoretic Criterion over Probabilistic Data Streams
As the development of data mining technologies for sensor data streams, more sophisticated methods for complex event processing are demanded. In the case of event recognition, since event recognition results may contain errors, we need to deal with the uncertainty of events. We therefore consider probabilistic event data streams with occurrence probabilities of events, and develop a pattern mat...
متن کاملRegular Programming for Quantitative Properties of Data Streams
We propose regular cost expressions (RCEs) as a high-level programming abstraction for specifying complex numerical queries over data streams in a modular way. Our language allows the arbitrary nesting of orthogonal sets of combinators: (a) generalized versions of choice, concatenation, and Kleene-iteration from regular expressions, (b) streaming (serial) composition, and (c) numerical operator...
متن کاملConstraint Programming on Infinite Data Streams
Classical constraint satisfaction problems (CSPs) are commonly defined on finite domains. In real life, constrained variables can evolve over time. A variable can actually take an infinite sequence of values over discrete time points. In this paper, we propose constraint programming on infinite data streams, which provides a natural way to model constrained time-varying problems. In our framewo...
متن کاملRamified Structural Recursion and Corecursion
We investigate feasible computation over a fairly general notion of data and codata. Specifically, we present a direct Bellantoni-Cookstyle normal/safe typed programming formalism, RS1 , that expresses feasible structural recursions and corecursions over data and codata specified by polynomial functors. (Lists, streams, finite trees, infinite trees, etc. are all directly definable.) A novel asp...
متن کاملDerivatives of Quantitative Regular Expressions
Quantitative regular expressions (QREs) have been recently proposed as a high-level declarative language for specifying complex numerical queries over data streams in a modular way. QREs have appealing theoretical properties, and each QRE can be compiled into an efficient streaming algorithm for its evaluation. In this paper, we generalize the notion of Brzozowski derivatives for classical regu...
متن کامل